Confidence-based Denoising Relying on a Transformation-invariant, Robust Patch Similarity - Exploring Ways to Improve Patch Synchronous Summation
نویسندگان
چکیده
Patch-based denoising techniques have proved to be very efficient. Indeed, they account for the correlations that exist among the patches of natural images, even when degraded by noise. In this context, we propose a denoising method which tries to minimize over-smoothing of textured areas (an effect observed with NLmeans), to avoid staircase effects in monotonically varying areas (an effect observed with BM3D), and to limit spurious patterns in areas with virtually no variations. The first step of the proposed method is to perform patch denoising by averaging similar patches of the noisy image (the equivalent in the space of patches to synchronous summation for temporal signals). From there, our contribution is twofold. (a) We proposed to combine the resulting overlapping denoised patches accounting for an assessed patch denoising confidence. (b) Since a crucial aspect is the definition of a similarity between two patches, we defined a patch similarity invariant to some transformations and robust to noise thanks to a polynomial patch approximation, instead of a classical weighted L2-similarity. The experimental results show an arguably better visual quality of images denoised using the proposed method compared to NL-means and BM3D. In terms of PSNR, the results are significantly above NL-means and comparable to BM3D.
منابع مشابه
A Novel Patch-Based Digital Signature
In this paper a new patch-based digital signature (DS) is proposed. The proposed approach similar to steganography methods hides the secure message in a host image. However, it uses a patch-based key to encode/decode the data like cryptography approaches. Both the host image and key patches are randomly initialized. The proposed approach consists of encoding and decoding algorithms. The encodin...
متن کاملFast Preprocessing for Robust Face Sketch Synthesis
Exemplar-based face sketch synthesis methods usually meet the challenging problem that input photos are captured in different lighting conditions from training photos. The critical step causing the failure is the search of similar patch candidates for an input photo patch. Conventional illumination invariant patch distances are adopted rather than directly relying on pixel intensity difference,...
متن کاملPatch-based models and algorithms for image denoising: a comparative review between patch-based images denoising methods for additive noise reduction
Background: Digital images are captured using sensors during the data acquisition phase, where they are often contaminated by noise (an undesired random signal). Such noise can also be produced during transmission or by poor-quality lossy image compression. Reducing the noise and enhancing the images are considered the central process to all other digital image processing tasks. The improvement...
متن کاملA principled approach to image denoising with similarity kernels involving patches
Denoising is a cornerstone of image analysis and remains a very active research field. This paper deals with image filters that rely on similarity kernels to compute weighted pixel averages. Whereas similarities have been based on the comparison of isolated pixel values until recently, modern filters extend the paradigm to groups of pixels called patches. Significant quality improvements result...
متن کاملA Non-Local Means Approach for Gaussian Noise Removal from Images using a Modified Weighting Kernel
Gaussian noise removal is an interesting area in digital image processing not only to improve the visual quality, but for its impact on other post-processing algorithms like image registration or segmentation. Many presented state-of-the-art denoising methods are based on the self-similarity or patch-based image processing. Specifically, Non-Local Means (NLM) as a patch-based filter has gained ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2011